A context dependent equivalence between processes

Fast equivalence-checking for normed context-free processes

Bisimulation equivalence is decidable in polynomial time over normed graphs generated by a context-free grammar. We present a new algorithm, working in time O(n5), thus improving the previously known complexity O(n8polylog(n)). It also improves the previously known complexity O(n6polylog(n)) of the equality problem for simple grammars. Digital Object Identifier 10.4230/LIPIcs.FSTTCS.2010.1

Faster Algorithm for Bisimulation Equivalence of Normed Context-Free Processes

The fastest known algorithm for checking bisimulation equivalence of normed context-free processes worked in O(n) time. We give an alternative algorithm working in O(npolylog n) time, As a side effect we improve the best known upper bound for testing equivalence of simple context-free grammars from O(npolylog n) to O(npolylog n).

Bisimulation Equivalence is Decidable for all Context-Free Processes

Decidability of Bisimulation Equivalence of Context-free Processes Extends to Processes Deened over Bpa

In CHS92] was proved that (strong) bisimulation equivalence is de-cidable for all context-free processes. We reduce eeectively the question of bisimulation equivalence of processes in BPA to that of context-free processes, by interpreting the deadlocking process as a process which iterates a fresh action forever. This shows that bisimulation is also decidable for BPA. 1 Introduction In BBK87, B...

A Polynomial-time Algorithm for Deciding Equivalence of Normed Context-free Processes

A polynomial-time procedure is presented for deciding bisimilarity of normed context-free processes. It follows as a corollary that language equivalence of simple context-free grammars is decidable in polynomial time.